Evaluation Study for Delay and Link Utilization with the New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm

As the Internet becomes increasingly heterogeneous, the issue of congestion avoidance and control becomes ever more important. And the queue length, end-to-end delays and link utilization is some of the important things in term of congestion avoidance and control mechanisms. In this work we continue to study the performances of the New-AIMD (Additive Increase Multiplicative Decrease) mechanism as one of the core protocols for TCP congestion avoidance and control algorithm, we want to evaluate the effect of using the AIMD algorithm after developing it to find a new approach, as we called it the New-AIMD algorithm to measure the Queue length, delay and bottleneck link utilization, and use the NCTUns simulator to get the results after make the modification for the mechanism. And we will use the Droptail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we expect the delay will less when we measure the delay dependent on the throughput for all the system, and also we expect to get end-to-end delay less. And we will measure the second type of delay a (queuing delay), as we shown in the figure 1 bellow. Also we will measure the bottleneck link utilization, and we expect to get high utilization for bottleneck link with using this mechanism, and avoid the collisions in the link

On the delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm

Additive increase multiplicative decrease (AIMD) algorithm is the prevailing algorithm for congestion avoidance and control in the Internet. Reducing the end-to-end delays and enhancement of the link utilization are the important goals of this algorithm. In this work, we continue to study the performance of the New-AIMD (additive increase multiplicative decrease) mechanism as one of the core protocols for TCP, to avoid and control the congestion. We want to evaluate the effect of using the AIMD algorithm after developing it, which we called the New-AIMD algorithm, to find a new approach to measure the end-to-end delay and bottleneck link utilization and use the NCTUns simulator to obtain the results after making the modification for the mechanism. We will use the DropTail mechanism as the active queue management mechanism (AQM) in the bottleneck router. After the implementation of our new approach with a different number of flows, we expect the end-to-end delay to be less when we measure the delay dependent on the throughput for the entire system. In addition, we will measure the bottleneck link utilization using this mechanism and expect to get high utilization for bottleneck link and avoid the collisions in the link

Efficiency and fairness of new-additive increase multiplicative decrease congestion avoidance and control algorithm

When using of the Internet increased dramatically; the congestion avoidance problem became even more important. The congestion is usually caused by the multiplexing for packets when the packets are at the bottleneck links. Efficiency and fairness are the important metrics in the performance of congestion avoidance mechanisms. And also all of the researches for the congestion avoidance algorithms, interest about this parameters metrics to evaluate the performance of the algorithms. This research studied the performance of the New-Additive Increase Multiplicative Decrease (AIMD) algorithm as one of the core protocols for the TCP congestion avoidance and control mechanism. In addition, to evaluate the effect of using the AIMD algorithm after its development to measure the efficiency and fairness and find new enhancement results for our approach, which named as the New-AIMD algorithm. The NCTUns simulator is used to obtain the results after implementing the modifications to the mechanism

The delay with new-additive increase multiplicative decrease congestion avoidance and control algorithm.

As the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. And the queue length and end-to-end (congestion) delays are some of the important things in term of congestion avoidance and control mechanisms. In this research we continued to study the performances of the New-Additive Increase Multiplicative Decrease (AIMD) algorithm as one of the core protocols for TCP congestion avoidance and control mechanism, we want now to evaluate the effect of using the New-AIMD algorithm to measure the queue length and end-to-end delays and we will use the NCTUns simulator to get the results after make the modification of the mechanism. And we will use the Drop tail mechanism as Active Queue Management (AQM) in the bottleneck router. After implementation of our new approach with different number of flows, we will measure the delay for two types of delays (queuing delay and end-to-end delay), we expect the delay will be less with using our mechanism comparing with the mechanism in the previous study. Now and after got this results as low delay for bottleneck link case, we know the New-AIMD mechanism work as well under the network condition in the experiments

The TCP-based new AIMD congestion control algorithm

Congestion control is one of the fundamental issues in computer networks. Without proper congestion control mechanisms there is the possibility of inefficient utilization of resources, ultimately leading to network collapse. Hence congestion control is an effort to adapt the performance of a network to changes in the traffic load without adversely affecting users perceived utilities. AIMD (Additive Increase Multiplicative Decrease) is the best algorithm among the set of liner algorithms because it reflects good efficiency as well as good fairness. Our control model is based on the assumption of the original AIMD algorithm; we show that both efficiency and fairness of AIMD can be improved. We call our approach is New AIMD. We present experimental results with TCP that match the expectation of our theoretical analysis

Fairness Of the TCP-based new AIMD congestion control algorithm.

Congestion control is one of the fundamental issues in computer networks. Without proper congestion control mechanisms there is the possibility of in efficient utilization of resources, ultimately leading to network collapse. Hence congestion control is an effort to adapt the performance of a network to change in the traffic load without adversely affecting users perceived utilities. AIMD (Additive Increase Multiplicative Decrease) is the best algorithm among the set of linear algorithms because it reflects good efficiency as well as good fairness. Our control model is based on the assumption of the original AIMD algorithm; we show that both efficiency and fairness of AIMD can be improved. We call our approach is New AIMD. We present experimental results with TCP that match the expectation of our theoretical analysis

Performance enhancement of AIMD algorithm for congestion avoidance and control

Computer networks have revolutionized the human life in the end of the last century. Two major technical differences between telephone communication and the computer networks are as follows. First, telephones use a dedicated physical wire for each communication between two parties (circuit switched network). In contrast, computers share this physical line between many – unlimited, at least theoretically – computers (packet switch network). Secondly, telephone communication is used only for voice messages while the packets in packet switch network can contain any kind of information, even voice messages. It should be obvious that these automatic robots (computers) need specific rules and regulations (protocols) to be able to communicate, interleaving data, through a single connection channel (e.g. bottleneck link). These protocols have been developed and improved since the advent of the Internet. One major issue arose in 80s when routers got congested and the connections collapsed because they were pushed to their limits by the competing robots for connection. Since then, many mechanisms have been suggested and developed to solve this problem. New applications in computers and their specific requirements for communication have even added more complexity to this issue. Hence, more work needs to be done. Additive Increase Multiplicative decrease (AIMD) is one of the best principles offered to solve this problem. This study is also in this field and offers an enhanced version of this mechanism. The contribution of this research is to improve the performance of AIMD in terms of efficiency (the network utilization) and fairness. National Chiao Tung University’s network simulation (NCTUns) has been used in this development to compare the new algorithm with the older versions and determine its advantages over the older versions. In addition to theoretical (mathematical) proof and to provide laboratory confirmation,this research has also used NCTUns to conduct tests and experiments to measure different performance metrics of the new algorithm such as end-to-end delay, link utilization, efficiency and fairness, and compared the results with the results of the same tests on older versions. The results have shown improvement in all aspects particularly the major ones, efficiency and fairness over the previous algorithms

Experimental Evaluation of Bottleneck Link Utilization with New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm

Abstract: Problem statement: As the Internet becomes increasingly heterogeneous, the issue of congestion control becomes ever more important. And the link utilization is one of the important things in term of congestion avoidance and control mechanisms. And we can define the utilization as simply the throughput divided by the access rate. And also all the developments for the congestion control and avoidance algorithms interest about the using of network resources and use the links capacity (utilization). Approach: In this research we continued to study the performances of the New-Additive Increase Multiplicative Decrease (AIMD) algorithm as one of the core protocols for TCP congestion avoidance and control mechanism, we want now to evaluate the effect of using the AIMD algorithm after developing it to find a new approach, as we called it the New-AIMD algorithm to measure the bottleneck link utilization and use the NCTUns simulator to get the results after make the modification of the mechanism. And we will use the Droptail mechanism as Active Queue Management (AQM) in the bottleneck router. Results: After implementation of our new approach with different number of flows, we will measure the bottleneck link utilization and we will get high utilization (more than 94%) for bottleneck link with using this mechanism and avoid the collisions in the link. Conclusion: Now and after got this results as high utilization for bottleneck link, we know the New-AIMD mechanism work as well under the giving network condition in the experiments